On the computational power of DNA annealing and ligation

نویسنده

  • Erik Winfree
چکیده

In [20] it was shown that the DNA primitives of Separate, Merge, and Amplify were not sufficiently powerful to invert functions defined by circuits in linear time. Dan Boneh et al [4] show that the addition of a ligation primitive, Append, provides the missing power. The question becomes, "How powerful is ligation? Are Separate, Merge, and Amplify necessary at all?" This paper proposes to informally explore the power of annealing and ligation for DNA computation. We conclude, in fact , that annealing and ligation alone are theoretically capable of universal computation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synthesis and Expression of Modified bFGF Gene in Escherichia coli Cells

A new strategy for construction of synthetic gene encoding human basic fibroblast growth factor comprising DNA annealing-ligation and augmentation by polymerase chain reaction was introduced. The sequence of the gene and corresponding amino acid chain were modified in order to increase stability of the protein. First, 300 bp and 160 bp fragments of the gene were assembled from 18 oligonucleotid...

متن کامل

Efficient DNA ligation by selective heating of DNA ligase with a radio frequency alternating magnetic field

We present a simple method for efficient DNA ligation utilizing the heat generation of ferromagnetic particles subjected to an ac magnetic field. We carry out the ligation of DNA fragments with cohesive ends using T4 DNA ligase immobilized on the surface of ferromagnetic particles. When a radio frequency alternating magnetic field is applied, ferromagnetic particles dissipate heat and DNA ligas...

متن کامل

AN EFFICIENT HYBRID ALGORITHM BASED ON PARTICLE SWARM AND SIMULATED ANNEALING FOR OPTIMAL DESIGN OF SPACE TRUSSES

In this paper, an efficient optimization algorithm is proposed based on Particle Swarm Optimization (PSO) and Simulated Annealing (SA) to optimize truss structures. The proposed algorithm utilizes the PSO for finding high fitness regions in the search space and the SA is used to perform further investigation in these regions. This strategy helps to use of information obtained by swarm in an opt...

متن کامل

A Routing-Aware Simulated Annealing-based Placement Method in Wireless Network on Chips

Wireless network on chip (WiNoC) is one of the promising on-chip interconnection networks for on-chip system architectures. In addition to wired links, these architectures also use wireless links. Using these wireless links makes packets reach destination nodes faster and with less power consumption. These wireless links are provided by wireless interfaces in wireless routers. The WiNoC archite...

متن کامل

Experiments To Determine The Simulated Annealing Parameters Case Study In VRP

In this paper we describe the distribution problems faced by one of the largest retailers in the distribution and sale of fast moving consumer goods in the U.K. The paper describes an initial solution method, which is then improved by a novel form of simulated annealing. A computational experiment for the improvement algorithm has been also carried out in order to illustrate the flexibility of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995